Fast and Accurate Redistancing by Directional Optimization
نویسندگان
چکیده
منابع مشابه
Fast and Accurate Redistancing by Directional Optimization
A fast and accurate algorithm for the reinitialization of the signed distance function in two and three spatial dimensions is presented. The algorithm has computational complexity O(N logN) for the reinitialization of N grid points. The order of accuracy of the reinitialization is demonstrated to depend primarily on the interpolation algorithm used. Bicubic interpolation is demonstrated to resu...
متن کاملFast and Accurate Redistancing for Level Set Methods
Although the Level Set Method [4] has only recently been introduced as an image processing tool, it has already proved useful in delineating contours and in segmenting objects. However, since this method represents contours with images, processing time may increase considerably. To offset this problem, it is common to create a narrow band of the image points lying within a given distance to the...
متن کاملFast and Accurate Structural RNA Alignment by Progressive Lagrangian Optimization
During the last few years new functionalities of RNA have been discovered, renewing the need for computational tools for their analysis. To this respect, multiple sequence alignment is an essential step in finding structurally conserved regions in related RNA sequences. In contrast to proteins, many classes of functionally related RNA molecules show a rather weak sequence conservation but inste...
متن کاملFast Tree-Based Redistancing forLevel Set Computations
Level set methods for moving interface problems require efficient techniques for transforming an interface to a globally defined function whose zero set is the interface, such as the signed distance to the interface. This paper presents efficient algorithms for this “redistancing” problem. The algorithms use quadtrees and triangulation to compute global approximate signed distance functions. A ...
متن کاملAn Accurate and Robust Finite Element Level Set Redistancing Method
A new redistancing method for piecewise polynomial finite element level set functions is introduced. The method directly computes the distance to the implicitly given discrete level set. Rigorous error bounds and numerical experiments are provided. Both show that, up to constants, the method is as good as the nodal interpolation of the computationally unavailable signed distance function of the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Scientific Computing
سال: 2014
ISSN: 1064-8275,1095-7197
DOI: 10.1137/120889447